TSTP Solution File: SEV185^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV185^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:40 EDT 2024
% Result : Theorem 0.22s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 43 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 382 ( 147 equ; 0 cnn)
% Maximal formula atoms : 22 ( 11 avg)
% Number of connectives : 455 ( 74 ~; 63 |; 48 &; 234 @)
% ( 0 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 116 ( 116 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 135 ( 0 ^ 100 !; 34 ?; 135 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_4,type,
sK0: ( b > $o ) > $o ).
thf(func_def_5,type,
sK1: ( b > $o ) > b > $o ).
thf(func_def_6,type,
sK2: ( b > $o ) > ( b > $o ) > b ).
thf(func_def_7,type,
sK3: b > $o ).
thf(func_def_8,type,
sK4: b ).
thf(func_def_9,type,
sK5: b > $o ).
thf(func_def_12,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f36,plain,
$false,
inference(subsumption_resolution,[],[f35,f15]) ).
thf(f15,plain,
( $true
!= ( sK5 @ sK4 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ( ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true )
& ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) )
| ( ( sK0 @ X2 )
!= $true ) )
& ( ( sK1 @ sK3 @ sK4 )
= $true )
& ( $true
= ( sK0 @ sK5 ) )
& ( $true
!= ( sK5 @ sK4 ) )
& ! [X9: b] :
( ( $true
!= ( sK3 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK0 @ X10 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( ( X0 @ X2 )
!= $true ) )
& ? [X6: b > $o,X7: b] :
( ( ( X1 @ X6 @ X7 )
= $true )
& ? [X8: b > $o] :
( ( $true
= ( X0 @ X8 ) )
& ( $true
!= ( X8 @ X7 ) ) )
& ! [X9: b] :
( ( $true
!= ( X6 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( ( X0 @ X10 )
!= $true ) ) ) ) )
=> ( ! [X2: b > $o] :
( ! [X4: b,X3: b > $o] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) )
| ( ( sK0 @ X2 )
!= $true ) )
& ? [X7: b,X6: b > $o] :
( ( ( sK1 @ X6 @ X7 )
= $true )
& ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ X7 ) ) )
& ! [X9: b] :
( ( $true
!= ( X6 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK0 @ X10 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: b > $o,X3: b > $o] :
( ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
=> ( ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true )
& ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X7: b,X6: b > $o] :
( ( ( sK1 @ X6 @ X7 )
= $true )
& ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ X7 ) ) )
& ! [X9: b] :
( ( $true
!= ( X6 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK0 @ X10 ) ) ) ) )
=> ( ( ( sK1 @ sK3 @ sK4 )
= $true )
& ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ sK4 ) ) )
& ! [X9: b] :
( ( $true
!= ( sK3 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK0 @ X10 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X8: b > $o] :
( ( $true
= ( sK0 @ X8 ) )
& ( $true
!= ( X8 @ sK4 ) ) )
=> ( ( $true
= ( sK0 @ sK5 ) )
& ( $true
!= ( sK5 @ sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) )
| ( ( X0 @ X2 )
!= $true ) )
& ? [X6: b > $o,X7: b] :
( ( ( X1 @ X6 @ X7 )
= $true )
& ? [X8: b > $o] :
( ( $true
= ( X0 @ X8 ) )
& ( $true
!= ( X8 @ X7 ) ) )
& ! [X9: b] :
( ( $true
!= ( X6 @ X9 ) )
| ! [X10: b > $o] :
( ( $true
= ( X10 @ X9 ) )
| ( ( X0 @ X10 )
!= $true ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X1: ( b > $o ) > $o,X0: ( b > $o ) > b > $o] :
( ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
| ( ( X0 @ X3 @ X4 )
!= $true ) )
| ( ( X1 @ X2 )
!= $true ) )
& ? [X7: b > $o,X6: b] :
( ( ( X0 @ X7 @ X6 )
= $true )
& ? [X10: b > $o] :
( ( $true
= ( X1 @ X10 ) )
& ( ( X10 @ X6 )
!= $true ) )
& ! [X8: b] :
( ( ( X7 @ X8 )
!= $true )
| ! [X9: b > $o] :
( ( $true
= ( X9 @ X8 ) )
| ( $true
!= ( X1 @ X9 ) ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > $o] :
( ? [X7: b > $o,X6: b] :
( ? [X10: b > $o] :
( ( $true
= ( X1 @ X10 ) )
& ( ( X10 @ X6 )
!= $true ) )
& ! [X8: b] :
( ( ( X7 @ X8 )
!= $true )
| ! [X9: b > $o] :
( ( $true
= ( X9 @ X8 ) )
| ( $true
!= ( X1 @ X9 ) ) ) )
& ( ( X0 @ X7 @ X6 )
= $true ) )
& ! [X2: b > $o] :
( ! [X3: b > $o,X4: b] :
( ( ( X2 @ X4 )
= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X3 @ X5 )
= $true ) )
| ( ( X0 @ X3 @ X4 )
!= $true ) )
| ( ( X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( ( X1 @ X2 )
= $true )
=> ! [X3: b > $o,X4: b] :
( ( ! [X5: b] :
( ( ( X3 @ X5 )
= $true )
=> ( ( X2 @ X5 )
= $true ) )
& ( ( X0 @ X3 @ X4 )
= $true ) )
=> ( ( X2 @ X4 )
= $true ) ) )
=> ! [X7: b > $o,X6: b] :
( ( ! [X8: b] :
( ( ( X7 @ X8 )
= $true )
=> ! [X9: b > $o] :
( ( $true
= ( X1 @ X9 ) )
=> ( $true
= ( X9 @ X8 ) ) ) )
& ( ( X0 @ X7 @ X6 )
= $true ) )
=> ! [X10: b > $o] :
( ( $true
= ( X1 @ X10 ) )
=> ( ( X10 @ X6 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ( X2 @ X4 ) ) )
=> ! [X6: b,X7: b > $o] :
( ( ( X0 @ X7 @ X6 )
& ! [X8: b] :
( ( X7 @ X8 )
=> ! [X9: b > $o] :
( ( X1 @ X9 )
=> ( X9 @ X8 ) ) ) )
=> ! [X10: b > $o] :
( ( X1 @ X10 )
=> ( X10 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ( X2 @ X4 ) ) )
=> ! [X4: b,X3: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( b > $o ) > b > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ( X2 @ X4 ) ) )
=> ! [X4: b,X3: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GAZ1gTT6eT/Vampire---4.8_2725',cTHM564_pme) ).
thf(f35,plain,
( $true
= ( sK5 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f34,plain,
( ( $true
= ( sK5 @ sK4 ) )
| ( $true != $true ) ),
inference(superposition,[],[f33,f17]) ).
thf(f17,plain,
( ( sK1 @ sK3 @ sK4 )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f33,plain,
! [X0: b] :
( ( ( sK1 @ sK3 @ X0 )
!= $true )
| ( ( sK5 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
! [X0: b] :
( ( $true != $true )
| ( ( sK5 @ X0 )
= $true )
| ( ( sK1 @ sK3 @ X0 )
!= $true ) ),
inference(superposition,[],[f31,f28]) ).
thf(f28,plain,
( $true
= ( sK5 @ ( sK2 @ sK3 @ sK5 ) ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f27,plain,
( ( $true
= ( sK5 @ ( sK2 @ sK3 @ sK5 ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f21,f26]) ).
thf(f26,plain,
( $true
= ( sK3 @ ( sK2 @ sK3 @ sK5 ) ) ),
inference(subsumption_resolution,[],[f25,f15]) ).
thf(f25,plain,
( ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK5 ) ) )
| ( $true
= ( sK5 @ sK4 ) ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK5 ) ) )
| ( $true
= ( sK5 @ sK4 ) )
| ( $true != $true ) ),
inference(superposition,[],[f23,f17]) ).
thf(f23,plain,
! [X0: b,X1: b > $o] :
( ( $true
!= ( sK1 @ X1 @ X0 ) )
| ( ( sK5 @ X0 )
= $true )
| ( $true
= ( X1 @ ( sK2 @ X1 @ sK5 ) ) ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
! [X0: b,X1: b > $o] :
( ( ( sK5 @ X0 )
= $true )
| ( $true
= ( X1 @ ( sK2 @ X1 @ sK5 ) ) )
| ( $true
!= ( sK1 @ X1 @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f18,f16]) ).
thf(f16,plain,
( $true
= ( sK0 @ sK5 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
! [X2: b > $o,X3: b > $o,X4: b] :
( ( ( sK0 @ X2 )
!= $true )
| ( ( X2 @ X4 )
= $true )
| ( $true
= ( X3 @ ( sK2 @ X3 @ X2 ) ) )
| ( $true
!= ( sK1 @ X3 @ X4 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f21,plain,
! [X0: b] :
( ( $true
!= ( sK3 @ X0 ) )
| ( ( sK5 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
! [X0: b] :
( ( $true
!= ( sK3 @ X0 ) )
| ( ( sK5 @ X0 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f14,f16]) ).
thf(f14,plain,
! [X10: b > $o,X9: b] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) )
| ( $true
!= ( sK3 @ X9 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f31,plain,
! [X0: b,X1: b > $o] :
( ( ( sK5 @ ( sK2 @ X1 @ sK5 ) )
!= $true )
| ( $true
!= ( sK1 @ X1 @ X0 ) )
| ( ( sK5 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
! [X0: b,X1: b > $o] :
( ( $true != $true )
| ( ( sK5 @ ( sK2 @ X1 @ sK5 ) )
!= $true )
| ( $true
!= ( sK1 @ X1 @ X0 ) )
| ( ( sK5 @ X0 )
= $true ) ),
inference(superposition,[],[f19,f16]) ).
thf(f19,plain,
! [X2: b > $o,X3: b > $o,X4: b] :
( ( ( sK0 @ X2 )
!= $true )
| ( ( X2 @ X4 )
= $true )
| ( $true
!= ( sK1 @ X3 @ X4 ) )
| ( ( X2 @ ( sK2 @ X3 @ X2 ) )
!= $true ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV185^5 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:05:05 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.GAZ1gTT6eT/Vampire---4.8_2725
% 0.22/0.38 % (2988)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.22/0.38 % (2987)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.22/0.38 % (2985)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.22/0.38 % (2986)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.22/0.38 % (2989)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.22/0.38 % (2990)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.22/0.38 % (2991)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.22/0.38 % (2992)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.22/0.38 % (2989)Instruction limit reached!
% 0.22/0.38 % (2989)------------------------------
% 0.22/0.38 % (2989)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (2989)Termination reason: Unknown
% 0.22/0.38 % (2989)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (2989)Memory used [KB]: 895
% 0.22/0.38 % (2989)Time elapsed: 0.003 s
% 0.22/0.38 % (2989)Instructions burned: 2 (million)
% 0.22/0.38 % (2989)------------------------------
% 0.22/0.38 % (2989)------------------------------
% 0.22/0.38 % (2988)Instruction limit reached!
% 0.22/0.38 % (2988)------------------------------
% 0.22/0.38 % (2988)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (2988)Termination reason: Unknown
% 0.22/0.38 % (2988)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (2988)Memory used [KB]: 5500
% 0.22/0.38 % (2988)Time elapsed: 0.004 s
% 0.22/0.38 % (2988)Instructions burned: 2 (million)
% 0.22/0.38 % (2988)------------------------------
% 0.22/0.38 % (2988)------------------------------
% 0.22/0.38 % (2992)Instruction limit reached!
% 0.22/0.38 % (2992)------------------------------
% 0.22/0.38 % (2992)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (2992)Termination reason: Unknown
% 0.22/0.38 % (2992)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (2992)Memory used [KB]: 5500
% 0.22/0.38 % (2992)Time elapsed: 0.005 s
% 0.22/0.38 % (2992)Instructions burned: 3 (million)
% 0.22/0.38 % (2992)------------------------------
% 0.22/0.38 % (2992)------------------------------
% 0.22/0.38 % (2986)Instruction limit reached!
% 0.22/0.38 % (2986)------------------------------
% 0.22/0.38 % (2986)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (2986)Termination reason: Unknown
% 0.22/0.38 % (2986)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (2986)Memory used [KB]: 5500
% 0.22/0.38 % (2986)Time elapsed: 0.005 s
% 0.22/0.38 % (2986)Instructions burned: 4 (million)
% 0.22/0.38 % (2986)------------------------------
% 0.22/0.38 % (2986)------------------------------
% 0.22/0.39 % (2991)First to succeed.
% 0.22/0.39 % (2987)Also succeeded, but the first one will report.
% 0.22/0.39 % (2991)Refutation found. Thanks to Tanya!
% 0.22/0.39 % SZS status Theorem for Vampire---4
% 0.22/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.39 % (2991)------------------------------
% 0.22/0.39 % (2991)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (2991)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (2991)Memory used [KB]: 5500
% 0.22/0.39 % (2991)Time elapsed: 0.008 s
% 0.22/0.39 % (2991)Instructions burned: 5 (million)
% 0.22/0.39 % (2991)------------------------------
% 0.22/0.39 % (2991)------------------------------
% 0.22/0.39 % (2984)Success in time 0.008 s
% 0.22/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------